Discrepancy of Sums of Three Arithmetic Progressions
نویسنده
چکیده
The set system of all arithmetic progressions on [n] is known to have a discrepancy of order n1/4. We investigate the discrepancy for the set system S3 n formed by all sums of three arithmetic progressions on [n] and show that the discrepancy of S3 n is bounded below by Ω(n1/2). Thus S3 n is one of the few explicit examples of systems with polynomially many sets and a discrepancy this high.
منابع مشابه
Discrepancy of Sums of two Arithmetic Progressions
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set [N ] = {1, 2, . . . , N} was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph is the hypergraph of sums of k (k ≥ 1 fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form A1 + A2 + . . . + Ak in [N ], wher...
متن کاملDiscrepancy in generalized arithmetic progressions
Estimating the discrepancy of the set of all arithmetic progressions in the first N natural numbers was one of the famous open problem in combinatorial discrepancy theory for a long time, successfully solved by K. Roth (lower bound) and Beck (upper bound). They proved that D(N) = minχ maxA | ∑ x∈A χ(x)| = Θ(N1/4), where the minimum is taken over all colorings χ : [N ] → {−1, 1} and the maximum ...
متن کاملOn the Average Value of Divisor Sums in Arithmetic Progressions
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modulus and show that “on average” these sums are close to the expected value. We also give applications of our result to sums of the divisor function twisted with characters (both additive and multiplicative) taken on the values of various functions, such as rational and exponential functions; in pa...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملDiscrepancy of Cartesian Products of Arithmetic Progressions
We determine the combinatorial discrepancy of the hypergraph H of cartesian products of d arithmetic progressions in the [N ]d–lattice ([N ] = {0, 1, . . . ,N − 1}). The study of such higher dimensional arithmetic progressions is motivated by a multi-dimensional version of van der Waerden’s theorem, namely the Gallai-theorem (1933). We solve the discrepancy problem for d–dimensional arithmetic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006